From Exhaustive Vacation Queues to Preemptive Priority Queues with General Interarrival Times

Optimal balking strategies in single-server queues with general service and vacation times

In many service systems arising in OR/MS applications, the servers may be temporarily unavailable, a fact that affects the sojourn time of a customer and his willingness to join. Several studies that explore the balking behavior of customers in Markovian models with vacations have recently appeared in the literature. In the present paper, we study the balking behavior of customers in the single...

On queues with service and interarrival times depending on waiting times

W D = max{0, B − A + YW}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p = 0 it describes the waiting time of the server in an alternating service model. For all other values of p this model describes a FCFS queue in which the service times and interarrival times depend linearly and ...

On the waiting times in queues with dependency between interarrival and service times

In this paper a queueing system with partial correlation is considered. We assume that the amount of work (service time) brought in by a customer and the subsequent interarrival time are dependent. We show that in this case stronger dependence between interarrival and service times leads to decreasing waiting times in the increasing convex ordering sense. This generalizes a result of Chao (Oper...

Optimal Policies for Multi-server Non-preemptive Priority Queues

We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of ex...

The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues